Human pose estimation in visual computing

ABSTRACT

The present invention discloses a method of estimating human pose comprising: modeling a human body as a tree structure; optimizing said tree structure through importance proposal probabilities and part priorities; performing foreground detection to create image region observation; and performing image segmentation to provide image edge observations.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to a field of visual interactive gaming,and, more specifically, to an apparatus for and a method of estimatinghuman pose.

2. Discussion of Related Art

Estimating human pose involves identification, characterization, andmonitoring of various parts of a human body. It is often useful todetermine size, shape, placement, and orientation of the body parts. Theparts may include the head, the torso, the arms, and the legs.

Human pose estimation can be useful in many different applications,including visual interactive gaming, immersive reality, content-basedimage retrieval, visual surveillance, and health care monitoring for oldand young people. Implementation of human pose estimation in the domainsof visual computing and consumer electronics typically requires acombination of hardware and software.

However, human pose estimation may be difficult to perform effectively,efficiently, and consistently, especially in real time environment.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a tree-structured human body model according to anembodiment of the present invention.

FIG. 2 shows body part states according to an embodiment of the presentinvention.

FIG. 3 shows a framework of a pose estimation method according to anembodiment of the present invention.

FIG. 4 shows a flowchart of local optimization under data-driven Markovchain Monte Carlo (DDMCMC) framework according to an embodiment of thepresent invention.

DETAILED DESCRIPTION OF THE PRESENT INVENTION

In the following description, numerous details, examples, andembodiments are set forth to provide a thorough understanding of thepresent invention. However, it will become clear and apparent to one ofordinary skill in the art that the invention is not limited to thedetails, examples, and embodiments set forth and that the invention maybe practiced without some of the particular details, examples, andembodiments that are described. In other instances, one of ordinaryskill in the art will further realize that certain details, examples,and embodiments that may be well-known have not been specificallydescribed so as to avoid obscuring the present invention.

The present invention discloses an apparatus for and a method ofestimating human pose. First, the torso of the human body is sampled.The sampling is then extended to the rest of the body. This approachonly requires that a local extremum be determined at each step which issimpler than determining a global extremum. Second, the body part is notsequentially chosen to be changed. Instead, priorities of body parts inhierarchical tree model and probabilities of proposals are bothconsidered. Third, as a Markov chain evolves, the part priorities, thepart dynamic probabilities, and the state dynamic probabilities changeand propagate.

As shown in an embodiment of the present invention in FIG. 1, a humanbody 5 is modeled as a three-level tree structure. A torso 10 is a rootwhile other parts are hierarchical branches. Directly attached to thetorso 10 are a head 20, a left upper arm 33, a right upper arm 36, aleft upper leg 63, and a right upper leg 66. Further attached to each ofthe upper arm/leg 33, 36, 63, and 66, is a corresponding lower arm/leg330, 360, 630, and 660. The limbs include the upper and lower arms andlegs.

As shown in an embodiment of the present invention in FIG. 2, each bodypart is represented by a rectangle. The body part is characterized by 5parameters: {x, y, θ, l, w}. Location is represented as (x, y).Orientation is represented as θ. Length is represented as l. Width isrepresented as w.

A Bayesian formulation may be established first. Designating X as astate of a human body and I as an observation of an image, poseestimation may be formulated as a Bayesian inference for estimating aposterior distribution:

P(X|I)∝P(I|X)P(X)   formula (1)

where P(I|X) is a likelihood of observations for state X, and P(X) isthe body constraints.

A simple and common solution for this estimating problem is the maximuma posteriori (MAP) estimate which is given by

X _(MAP) =arg(max x)P(X|I)   formula (2)

When calculating P(I|X), we consider both foreground region likelihoodP_(r)(I|X) and edge likelihood P_(e)(I|X), thus it can be written as theproduct of these two kinds of likelihood as follows:

P(I|X)=P _(r)(I|X)P _(e)(I|X)^(α)  formula (3)

where α is an exponent factor for edge likelihood, which controls itsweight to final likelihood calculation. Given a set of body states X, wecan synthesize a human body. Then, the foreground likelihood and theedge likelihood can be calculated by comparing it to the foreground andedge map. P(X) in formula (1) measures the constraints of the body,including spatial relations on location and orientation between twoconnected parts and length relations among body parts.

Next, an algorithm framework is set up. The framework of the algorithmis shown in FIG. 3. The inputs are source image 41, human bounding box42, foreground 43, and edge map 44. The human bounding box 42 isobtained from a human detector module. The foreground 43 is obtainedfrom a foreground extractor. The edge map 44 is obtained from imagesegmentation.

The pre-processes are not specially chosen; they only provide coarseinitial results for later processes. Other alternative processes mayalso be used.

An initial torso is first sampled from proposals given by the humanbounding box 42, the foreground 43, as well as the body constraints.

A bad torso is discarded by fast evaluation and rejection. Then, a newtorso will be sampled until a good torso is obtained.

After a good torso is obtained, the states of other body parts areinitialized according to the body constraints. Then, a localoptimization is run under a data-driven Markov chain Monte Carlo(DDMCMC) framework to obtain local maximum of posterior probability.This process is repeated in a loop 55 for N times. Finally, the MAPsolution 45 is recorded as the pose estimation result.

The details of the algorithm will be described next.

Initializing body states is done first. In the process of sampling aninitial torso 51, the human bounding box 42 gives an estimation of bodyheight. Proposed distribution of torso length l is obtained from thebody height according to the body constraints, and then torso width w isobtained from torso length l. A body mask may be obtained by dilatingthe foreground. Then a distance transform is run on the body mask.

The larger a point's distance value in a distance map, the more likelyit is going to be sampled as the torso center candidate. This producesproposals of the states x and y of the torso. The direction θ is sampledfrom a mixed Gaussian distribution. One element of the mixture is aperpendicular direction of the gradient of the center of the torso inthe distance map. Another element of the mixture is a direction of theprincipal axis of the foreground 43.

A bad torso may be identified by pre-judgment. The criteria for a badtorso are: 1) the area of foreground above shoulders is larger than acertain threshold or 2) the background ratio in head or in torso islarger than a certain threshold. After the torso sampling, other bodyparts are initialized according to the body constraints. Then all statesare set to their means.

Markov chain dynamics will be described next. Two kinds of dynamics aredesigned. Jump and diffusion represent large and small changesrespectively of the states of the body part. For jump, the state isfirst resampled from its distribution. Then local optimization occurs onthe subtree of the body (the root of the subtree is the chosen part, see[0023]). Body states will jump from one local maximum in a small statespace to another local maximum that is nearby.

Dynamic diffusion corresponds to a small change in one state. For acurrent state s, the state is first updated as follows:

s′=s±λ+ε  formula (4)

where λ is a step length and ε is Gaussian noise. The algebraic sign infront of λ is determined by judging whether the posterior probabilityincreases or not. Then, the algebraic sign remains the same and formula(4) is run repeatedly until the posterior probability decreases or thestate exceeds its range.

Local optimization under the DDMCMC framework is performed next as shownin FIG. 4 in an embodiment of the present invention. First, a body partis chosen 61 based on part weights. Then, a dynamic is chosen 62 basedon part dynamic probabilities. If the part chosen is the root and thedynamic is jump 70, then the local optimization of the tree iscompleted. Otherwise, a part state is further chosen 71 based on stateprobabilities of associated dynamic. These probabilities may be statejump probabilities or state diffusion probabilities, depending on whichdynamic was chosen before. Then, the dynamic is run 72 on the chosenpart state. After that, a decision is made 73 as whether to accept thenew states or not. Then, the probabilities propagation is run 74 inwhich part priorities, part dynamics probabilities, and state dynamicprobabilities change and propagate in certain rules. The processdescribed above is run repeatedly until a local maximum is reached.

The importance proposal probabilities and the part priorities aredescribed next. A body part is chosen based on part weights which can bedetermined by a product of importance proposal probability and partpriority. The importance proposal probability measures an extent, ordegree, of the body part agreeing with the foreground. A body issynthesized based on the body states and then compared with theforeground. The following aspects are considered when calculating thepart's importance proposal probability: (1) the area of background inthe synthesized body part region; (2) the foreground uncovered by thesynthesized body near the part; and (3) the area overlapping with otherparts. Thus, the importance proposal probability, P_(i), is given by

P_(i)∝(S_(bgIn)/S)+w(S_(fgOut))(S+S_(o))/(S²)   formula (5)

Where S_(bgIn) is the area of background in the part; S_(fgOut) is thearea of uncovered foreground nearby; S_(o) is the area of overlappingregion with other parts; S is the area of the part; and w is a weightcoefficient. In terms of formula (5), a body part with a large area ofbackground or overlapping region inside, or large area of uncoveredforeground nearby should be more likely to be chosen. The image edge isnot considered when calculating importance proposal probability becausesometimes bad image edge with a large amount of noise will introduceinefficiency and instability in computation.

Merely considering importance proposal probability when choosing a bodypart is not sufficient since the tree, or body topology, structure isnot considered. Sometimes, a parent node in a tree should be chosen tochange before its children even if the children have larger importanceproposal probabilities. This is because children node is controlled byits parent. For this reason, priority may be added for each body part.By selecting a correct priority, a part with smaller importance proposalprobabilities may have larger part weight so that it becomes more likelyto be chosen. Considering both of these two items will utilize visualcues and image observations, as well as fit the tree structure.Consequently, the state space may be explored much more efficiently.

Next, Metropolis Hastings approach is described. After a body part ischosen, a dynamic is chosen based on part dynamic probabilities. Then, astate is chosen based on state probabilities of the associated dynamicif local optimization does not end. After running the dynamic, adecision is made whether to accept the new states or not by using aMetropolis Hastings approach in which the probability of accepting newstates X′ at current states X is given by the following:

P(X→X′)=min {1, [(P(X′|I)P(X|X′)]/[P(X|I)P(X′|X)]}  formula (6)

It is assumed that P(X|X′)=P(X′|X) for simplicity. A factor k (k>1) maybe added to formula 6 to decrease the probability of accepting badstates, then the following will result:

P(X→X′)=min {1, [P(X′|I)/P(X|I)]^(k)}  formula (7)

Probabilities propagation is described next. The part priorities, thepart dynamic probabilities, and the state dynamic probabilities maychange and propagate after running dynamic. By designing an appropriateprobabilities propagation mechanism, a nearly ideal optimization processmay be achieved on the tree structure. The propagation mechanism is asfollows:

-   -   (a) If diffusion happens, the priority of this part and the        state diffusion probability fall; if the part has children, the        priorities of its children rise, else the priority of its parent        rises and its part diffusion probability decreases;    -   (b) If jump happens, the part jump probability and the state        jump probability decrease, the part priority falls, while the        priority of it parent rises and the part jump probability of its        parent increases;

Both part dynamic probabilities and state dynamic probabilities will benormalized. Parts priorities will propagate equivalently so that thetotal priorities of all parts will keep invariable. Such a process willoccur in the process of pose estimation with great probability:diffusions on limbs (upper and lower arms and legs) happen to get alocal maximum, then jump helps get out of the local maximum and to statespace nearby, and this process is repeated until a new torso is sampled.

Many embodiments and numerous details have been set forth above in orderto provide a thorough understanding of the present invention. Oneskilled in the art will appreciate that many of the features in oneembodiment are equally applicable to other embodiments. One skilled inthe art will also appreciate the ability to make various equivalentsubstitutions for those specific materials, processes, dimensions,concentrations, etc. described herein. It is to be understood that thedetailed description of the present invention should be taken asillustrative and not limiting, wherein the scope of the presentinvention should be determined by the claims that follow.

1. A method of estimating human pose comprising: modeling a human bodyas a tree structure; optimizing said tree structure through importanceproposal probabilities and part priorities; performing foregrounddetection to create image region observation; and performing imagesegmentation to provide image edge observations.
 2. The method of claim1 wherein said tree structure comprises 3 levels.
 3. The method of claim2 further comprising: sampling torso first to initialize body statesafter modeling said human body.
 4. The method of claim 3 furthercomprising: sampling other body parts to find local extremum aftersampling torso first.
 5. The method of claim 4 further comprising:optimizing said tree structure through part priorities and importanceproposal probabilities.
 6. The method of claim 5 further comprising:changing and propagating said part priorities, part dynamicprobabilities, and state dynamic probabilities; running localoptimization under data-driven Markov chain Monte Carlo (DDMCMC)framework.
 7. The method of claim 6 further comprising: choosing dynamicof jump to represent large changes of part states.
 8. The method ofclaim 7 further comprising: choosing dynamic of diffusion to representsmall changes of part states.
 9. The method of claim 8 furthercomprising: determining whether to accept new states or not byMetropolis Hasting approach after running said dynamic.
 10. An apparatusfor human pose estimation comprising: a source image acquirer; a humandetector module; a foreground extractor; and an image segmentation toget edge map.
 11. The apparatus of claim 10 wherein said human detectormodule provides a human bounding box to sample a torso.
 12. Theapparatus of claim 10 wherein said foreground extractor initializesstates of body parts.
 13. The apparatus of claim 10 wherein said edgemap helps calculate posterior probability.
 14. A method of localoptimization of a tree structure of a human body comprising: choosing abody part; choosing a dynamic; choosing a part state; running dynamic onsaid part state; deciding whether to accept new states or not; runningprobabilities propagation; and repeating until reach local maximum. 15.The method of claim 14 wherein said dynamic comprises: jump.
 16. Themethod of claim 14 wherein said dynamic comprises: diffusion.
 17. Themethod of claim 14 wherein said method of local optimization comprises:data-drive Markov chain Monte Carlo (DDMCMC) framework.
 18. The methodof claim 14 wherein said deciding whether to accept new states or notcomprises: Metropolis Hastings approach.
 19. The method of claim 14comprising: using a Bayesian inference and estimating observationlikelihood by considering a product of foreground region likelihood andedge likelihood.
 20. The method of claim 14 further comprising:measuring constraints of said human body including spatial relations onlocation and orientation between two connected parts and lengthrelations among said parts.